Scott Aaronson - PDFSEARCH.IO - Document Search Engine

Scott Aaronson
Results: 49

#	Item
41	Teaching Statement Scott Aaronson January 6, 2007 My basic proposal is to sing the ideas of theoretical computer science from the rooftops—by creating new undergraduate courses, training graduate students, helping tale Add to Reading List Source URL: www.scottaaronson.com Language: English - Date: 2007-01-07 23:25:27 Mathematical optimization Complexity classes NP-complete Computational complexity theory Algorithm P versus NP problem Quantum mechanics Quantum computer Sanjeev Arora Theoretical computer science Applied mathematics Mathematics
42	Teaching Statement Scott Aaronson January 6, 2007 My basic proposal is to sing the ideas of theoretical computer science from the rooftops—by creating new undergraduate courses, training graduate students, helping tale Add to Reading List Source URL: scottaaronson.com Language: English - Date: 2007-01-07 23:25:27 Mathematical optimization Complexity classes NP-complete Computational complexity theory Algorithm P versus NP problem Quantum mechanics Quantum computer Sanjeev Arora Theoretical computer science Applied mathematics Mathematics
43	Research Statement Scott Aaronson January 6, 2007 Most of my research deals with two questions: first, what are the ultimate limits on what can feasibly be computed in the physical world? Second, how can studying those l Add to Reading List Source URL: scottaaronson.com Language: English - Date: 2007-01-11 00:07:45 Computational complexity theory Quantum information science Models of computation Quantum algorithm PP Quantum computer QMA BQP Hidden subgroup problem Theoretical computer science Applied mathematics Quantum complexity theory
44	Scott Aaronson Associate Professor Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology Cambridge, MA USA[removed]Room 32-G638 Add to Reading List Source URL: scottaaronson.com Language: English - Date: 2014-04-08 17:36:59 Symposium on Theory of Computing PH ACM SIGACT Quantum complexity theory Symposium on Foundations of Computer Science Quantum Turing machine Quantum information science Ronald V. Book Computer science Theoretical computer science Applied mathematics Scott Aaronson
45	The Limits of Quantum Computers (DRAFT) Scott Aaronson For the published version—which differs significantly from this one—please see the March 2008 issue of Scientific American. “Haggar Physicists Develop ‘Quant Add to Reading List Source URL: www.ime.usp.br Language: English - Date: 2013-04-30 09:54:41 Complexity classes Mathematical optimization Quantum complexity theory NP-complete P versus NP problem Quantum computer Quantum algorithm NP PP Theoretical computer science Applied mathematics Computational complexity theory
46	A Linear-Optical Proof that the Permanent is #P-Hard Scott Aaronson∗ For Les Valiant, on the occasion of his Turing Award Add to Reading List Source URL: www.scottaaronson.com Language: English - Date: 2011-06-02 18:23:09 Quantum mechanics Quantum circuit Quantum gate Quantum computer PostBQP Qubit Quantum Fourier transform Controlled NOT gate Toffoli gate Theoretical computer science Quantum information science Applied mathematics
47	Limits on Efficient Computation in the Physical World by Scott Joel Aaronson Add to Reading List Source URL: www.scottaaronson.com Language: English - Date: 2006-11-24 04:16:06 Quantum information science Computational complexity theory Quantum algorithm Quantum computer PP BQP Quantum mechanics Continuous quantum computation D-Wave Systems Theoretical computer science Applied mathematics Quantum complexity theory
48	The Prime Facts: From Euclid to AKS c 2003 Scott Aaronson Add to Reading List Source URL: www.scottaaronson.com Language: English - Date: 2012-12-14 12:29:57 Integer sequences Modular arithmetic Prime number Solovay–Strassen primality test Composite number Trial division Quadratic residue Elliptic curve primality testing Mathematics Number theory Primality tests
49	PDF Document Add to Reading List Source URL: www.scottaaronson.com Language: English - Date: 2012-03-09 09:03:31 PH Symposium on Theory of Computing Quantum complexity theory ACM SIGACT Quantum Turing machine Symposium on Foundations of Computer Science Quantum information science Ronald V. Book Quantum information Theoretical computer science Applied mathematics Scott Aaronson

UPDATE